@Article{RibeiroMauBelLorLap:2016:BeAlOr,
author = "Ribeiro, Glaydston Mattos and Mauri, Geraldo Regis and Beluco,
Saulo de Castro and Lorena, Luiz Antonio Nogueira and Laporte,
Gilbert",
affiliation = "{Universidade Federal do Rio de Janeiro (UFRJ)} and {Universidade
Federal do Esp{\'{\i}}rito Santo (UFES)} and Schlumberger,
Matur{\'{\i}}n and {Instituto Nacional de Pesquisas Espaciais
(INPE)} and CIRRELT, HEC Montr{\'e}al",
title = "Berth allocation in an ore terminal with demurrage, despatch and
maintenance",
journal = "Computers and Industrial Engineering",
year = "2016",
volume = "96",
pages = "8--15",
month = "June",
keywords = "Adaptive large neighborhood search, Berth allocation problem,
Brazilian port, Solid bulk.",
abstract = "This paper presents a Berth Allocation Problem (BAP) encountered
in an ore terminal located in a Brazilian port. The BAP consists
of assigning ships to berthing positions along a quay in a port.
In the Brazilian port considered here, maintenance activities have
to be performed at the berths and extra fees (demurrage) or
rewards (despatch) for the port administrator are incurred. We
propose a mixed integer linear programming model for the problem
and a set of instances based on real data in order to validate the
model. An adaptive large neighborhood search (ALNS) heuristic is
applied to solve the instances and computational experiments are
performed. The results indicate that the ALNS heuristic yields
good solutions on all instances.",
doi = "10.1016/j.cie.2016.03.005",
url = "http://dx.doi.org/10.1016/j.cie.2016.03.005",
issn = "0360-8352",
language = "en",
targetfile = "ribeiro_berth.pdf",
urlaccessdate = "27 abr. 2024"
}